On the problem of Frobenius in three numbers
نویسنده
چکیده
For three positive integers ai, aj , ak pairwise coprime, we present an algorithm that find the least multiple of ai that is a positive linear combination of aj , ak. The average running time of this algorithm is O(Loga1). Using this algorithm and the chinese remainder theorem leads to a direct computation of the Frobenius number f(a1, a2, a3).
منابع مشابه
Elastic analysis of functionally graded rotating thick cylindrical pressure vessels with exponentially-varying properties using power series method of Frobenius
Based on the Frobenius series method, stresses analysis of the functionally graded rotating thick cylindrical pressure vessels (FGRTCPV) are examined. The vessel is considered in both plane stress and plane strain conditions. All of the cylindrical shell properties except the Poisson ratio are considered exponential function along the radial direction. The governing Navier equation for this pro...
متن کاملViewing Some Ordinary Differential Equations from the Angle of Derivative Polynomials
In the paper, the authors view some ordinary differential equations and their solutions from the angle of (the generalized) derivative polynomials and simplify some known identities for the Bernoulli numbers and polynomials, the Frobenius-Euler polynomials, the Euler numbers and polynomials, in terms of the Stirling numbers of the first and second kinds.
متن کاملUse of Fuzzy Numbers for Assessing Problem Solving Skills
The importance of Problem Solving (PS) has been realized for such a long time that in a direct or indirect way affects our daily lives in many ways. Assessment cases appear frequently for PS skills which involve a degree of uncertainty and (or) ambiguity. Fuzzy logic, due to its nature of characterizing such cases with multiple values, offers rich resources for dealing with them. On ...
متن کاملPERRON-FROBENIUS THEORY ON THE NUMERICAL RANGE FOR SOME CLASSES OF REAL MATRICES
We give further results for Perron-Frobenius theory on the numericalrange of real matrices and some other results generalized from nonnegative matricesto real matrices. We indicate two techniques for establishing the main theorem ofPerron and Frobenius on the numerical range. In the rst method, we use acorresponding version of Wielandt's lemma. The second technique involves graphtheory.
متن کاملThe Frobenius problem for numerical semigroups with embedding dimension equal to three
If S is a numerical semigroup with embedding dimension equal to three whose minimal generators are pairwise relatively prime numbers, then S = 〈a, b, cb − da〉 with a, b, c, d positive integers such that gcd(a, b) = gcd(a, c) = gcd(b, d) = 1, c ∈ {2, . . . , a− 1}, and a < b < cb− da. In this paper we give formulas, in terms of a, b, c, d, for the genus, the Frobenius number, and the set of pseu...
متن کاملOn a problem of Frobenius in three numbers
For three positive integers ai, aj , ak pairwise coprime, we present an algorithm that find the least multiple of ai that is a positive linear combination of aj , ak. The average running time of this algorithm is O(1). Using this algorithm and the chinese remainder theorem leads to a direct computation of the Frobenius number f(a1, a2, a3).
متن کامل